Revisiting Overflow in Integer Multiplication
نویسندگان
چکیده
منابع مشابه
Integer Multiplication with Overflow Detection or Saturation
ÐHigh-speed multiplication is frequently used in general-purpose and application-specific computer systems. These systems often support integer multiplication, where two n-bit integers are multiplied to produce a 2n-bit product. To prevent growth in word length, processors typically return the n least significant bits of the product and a flag that indicates whether or not overflow has occurred...
متن کاملPractical Integer Overflow Prevention
Integer overflows in commodity software are a main source for software bugs, which can result in exploitable memory corruption vulnerabilities and may eventually contribute to powerful software based exploits, i.e., code reuse attacks (CRAs). In this paper, we present INTGUARD, a symbolic execution based tool that can repair integer overflows with high-quality source code repairs. Specifically,...
متن کاملA Understanding Integer Overflow in C / C +
Integer overflow bugs in C and C++ programs are difficult to track down and may lead to fatal errors or exploitable vulnerabilities. Although a number of tools for finding these bugs exist, the situation is complicated because not all overflows are bugs. Better tools need to be constructed—but a thorough understanding of the issues behind these errors does not yet exist. We developed IOC, a dyn...
متن کاملRICB: Integer Overflow Vulnerability Dynamic Analysis via Buffer Overflow
Integer overflow vulnerability will cause buffer overflow. The research on the relationship between them will help us to detect integer overflow vulnerability. We present a dynamic analysis methods RICB (Runtime Integer Checking via Buffer overflow). Our approach includes decompile execute file to assembly language; debug the execute file step into and step out; locate the overflow points and c...
متن کاملFaster truncated integer multiplication
Let n > 1 and let u and v be integers in the interval 0 6 u, v < 2. We write M(n) for the cost of computing the full product of u and v, which is just the usual 2n-bit product uv. Unless otherwise specified, by ‘cost’ we mean the number of bit operations, under a model such as the multitape Turing machine [12]. In this paper we are interested in two types of truncated product. The low product o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2005
ISSN: 1549-3636
DOI: 10.3844/jcssp.2005.304.309